XXVII. Notes on madder colouring matters
نویسندگان
چکیده
منابع مشابه
Notes on Nonrepetitive Graph Colouring
A vertex colouring of a graph is nonrepetitive on paths if there is no path v1, v2, . . . , v2t such that vi and vt+i receive the same colour for all i = 1, 2, . . . , t. We determine the maximum density of a graph that admits a k-colouring that is nonrepetitive on paths. We prove that every graph has a subdivision that admits a 4-colouring that is nonrepetitive on paths. The best previous boun...
متن کاملNotes on Some Remedies. XXVII. Drugs in Helminthic Diseases, Part II
5. Hexylresorcinol.?It is a synthetic compound of pale yellow crystalline nature, probably the safest of the anthelmintics. It is very efficient in ascariasis and fairly satisfactory in oxyuriasis and ancylostomiasis. The drug can be given in freshly filled gelatine capsules or in the form of 1 crystoids ' anthelmintic pills with hard gelatine coating containing 0.1 and 0.2 gm. The dose is 1 gm...
متن کاملOn Edge-colouring Indiierence Graphs on Edge-colouring Indiierence Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suu-cient condition for 0 (G) = (G)+1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for indi...
متن کاملOn Edge - Colouring
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suu-cient condition for 0 (G) = (G) +1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for ind...
متن کاملOn Edge-Colouring Indifference Graphs
Vizing's theorem states that the chromatic index 0 (G) of a graph G is either the maximum degree (G) or (G) + 1. A graph G is called overfull if jE(G)j > (G)bjV (G)j=2c. A suucient condition for 0 (G) = (G) + 1 is that G contains an overfull subgraph H with (H) = (G). Plantholt proved that this condition is necessary for graphs with a universal vertex. In this paper, we conjecture that, for ind...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Chemical Society
سال: 1877
ISSN: 0368-1769
DOI: 10.1039/js8773100665